-
1 undecidable system
Большой англо-русский и русско-английский словарь > undecidable system
-
2 undecidable system
Математика: неразрешимая система -
3 undecidable system
мат. -
4 essentially undecidable system
Математика: существенно неразрешимая системаУниверсальный англо-русский словарь > essentially undecidable system
-
5 essentially undecidable system
English-Russian scientific dictionary > essentially undecidable system
-
6 undecidable
неразрешимый essentially undecidable system ≈ существенно неразрешимая система essentially undecidable theor ≈ существенно неразрешимая теория hereditarily undecidable theor ≈ наследственно неразрешимая теория nonessentially undecidable theor ≈ несущественно неразрешимая теория recursively undecidable theor ≈ рекурсивно неразрешимая теория strongly undecidable structure ≈ строго неразрешимая структура - effectively undecidable - essentially undecidable - hereditarity undecidable - strongly undecidable - undecidable arithmetic - undecidable formula - undecidable predicate - undecidable problem - undecidable proposition - undecidable relation - undecidable sentence - undecidable structure - undecidable system - undecidable theor НеразрешимоБольшой англо-русский и русско-английский словарь > undecidable
-
7 system
1) система; комплекс2) совокупность•- absolutely consistent system - absolutely direct indecomposable system - absolutely free system - absolutely irreducible system - absolutely isolated system - allowable coordinate system - almost linear system - ample linear system - artificial feel system - automatic block system - automatic deicing system - binary relational system - binary-coded decimal system - block tooling system - Cartesian coordinate system - completely controllable system - completely ergodic system - completely hyperbolic system - completely identifiable system - completely integrable system - completely irreducible system - completely regular system - completely stable system - completely stratified system - complex number system - conical coordinate system - derivational formal system - differential equation system - differential selsyn system - digital counting system - digital transmission system - elliptic coordinate system - elliptic cylindrical coordinate system - externally inconsistent system - finite state system - finitely axiomatizable system - finitely presented system - fully characteristic quotient system - fundamental system of solutions - hydraulic lift system - integrated switching system - isomorphically embedded system - kernel normal system - linearly dependent system - linearly independent system - live hydraulic system - locking protection system - meteor-burst communication system - modular programming system - parabolic cylindrical coordinate system - permanent four-wheel drive system - pure independent system - radio telephone system - reactor protection system - real number system - receiver-amplifier crioelectric system - remote-cylinder hydraulic system - semantically consistent system - simply consistent system - simply incomplete system - simply ordered system - spherical coordinate system - strongly multiplicative system - structurally stable system - sufficiently general coordinate system - system of frequency curves - system of rational numbers - time multiplex system - time-division multiplex system - uniformly complete system - univalent system of notation - universal system of notation - weakly closed system - weighted number system -
8 неразрешимая система
Большой англо-русский и русско-английский словарь > неразрешимая система
-
9 recursively
1) рекурсно
2) рекурсивно
3) рекуррентно ∙ completely recursively enumerable class ≈ вполне рекурсивно перечислимый класс general recursively inequal numbers ≈ общерекурсивно неравные числа general recursively irrational number ≈ общерекурсивно иррациональное число general recursively true ≈ общерекурсивно истинный general recursively true formula ≈ общерекурсивно истинная формула primitive recursively true ≈ примитивно-рекурсивно истинный recursively approximable set ≈ рекурсивно аппроксимируемое множество recursively axiomatizable theor ≈ рекурсивно аксиоматизируемая теория recursively axiomatized theor ≈ рекурсивно аксиоматизированная теория recursively bounded quantifier ≈ рекурсивно ограниченный квантор recursively calculable function ≈ рекурсивно вычислимая функция recursively complex number ≈ рекурсивно комплексное число recursively continuous function ≈ рекурсивно непрерывная функция recursively convergent function ≈ рекурсивно сходящаяся функция recursively convergent sequence ≈ рекурсивно сходящаяся последовательность recursively creative set ≈ рекурсивно креативное множество recursively defined function ≈ рекуррентно определенная функция recursively defined sequence ≈ рекурсивно определенная последовательность recursively differentiable function ≈ рекурсивно дифференцируемая функция recursively divergent function ≈ рекурсивно расходящаяся функция recursively divergent sequence ≈ рекурсивно расходящаяся последовательность recursively enumerable cylinder ≈ рекурсивно перечислимый цилиндр recursively enumerable degree ≈ рекурсивно перечислимая степень recursively enumerable index ≈ рекурсивно перечислимый индекс recursively enumerable ordinal ≈ рекурсивно перечислимое порядковое число recursively enumerable predicate ≈ рекурсивно перечислимый предикат recursively enumerable problem ≈ рекурсивно перечислимая проблема recursively enumerable relation ≈ рекурсивно перечислимое отношение recursively enumerable sequence ≈ рекурсивно перечислимая последовательность recursively enumerable set ≈ рекурсивное перечислимое множество recursively enumerable structure ≈ рекурсивно перечислимая структура recursively enumerable subclass ≈ рекурсивно перечислимый подкласс recursively enumerable subset ≈ рекурсивно перечислимое подмножество recursively enumerable theor ≈ рекурсивно перечислимая теория recursively equivalent sets ≈ рекурсивно эквивалентные множества recursively extensible function ≈ рекурсивно продолжаемая функция recursively incompletable theor ≈ рекурсивно непополнимая теория recursively indecomposable set ≈ рекурсивно неразложимое множество recursively inseparable sets ≈ рекурсивно неотделимые множества recursively invariant concept ≈ рекурсивно инвариантное понятие recursively invariant relation ≈ рекурсивно инвариантное отношение recursively isomorphic set ≈ рекурсивно изоморфное множество recursively presentable structure ≈ рекурсивно представимая структура recursively presented group ≈ рекурсивно определенная группа recursively productive set ≈ рекурсивно продуктивное множество recursively real number ≈ рекурсивно вещественное число recursively related system of notation ≈ рекурсивная по упорядочению система обозначений recursively representable operation ≈ рекурсивно представимая операция recursively representable relation ≈ рекурсивно представимое отношение recursively separable sets ≈ рекурсивно отделимые множества recursively solvable problem ≈ рекурсивно разрешимая проблема recursively undecidable theor ≈ рекурсивно неразрешимая теория recursively unequal numbers ≈ рекурсивно неравные числа - recursively axiomatized - recursively calculable - recursively closed - recursively computable - recursively conditional - recursively continuous - recursively convergent - recursively differentiable - recursively divergent - recursively enumerable - recursively equivalent - recursively expressible - recursively extensible - recursively inseparable - recursively isomorphic - recursively isotonic - recursively presentable - recursively projective - recursively realizable - recursively representable - recursively soluble - recursively true - recursively unsolvable РекурсивноБольшой англо-русский и русско-английский словарь > recursively
См. также в других словарях:
System F — System F, also known as the polymorphic lambda calculus or the second order lambda calculus, is a typed lambda calculus. It was discovered independently by the logician Jean Yves Girard and the computer scientist John C. Reynolds. System F… … Wikipedia
Undecidable problem — In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct an algorithm that leads to a yes or no answer the problem is not decidable.A decision problem is any … Wikipedia
Type system — Type systems Type safety Inferred vs. Manifest Dynamic vs. Static Strong vs. Weak Nominal vs. Structural Dependent typing Duck typing Latent typing Linear typing Uniqueness typing … Wikipedia
Semi-Thue system — In computer science and mathematics a Semi Thue system (also called a string rewriting system [Book and Otto, p. 36] ) is a type of term rewriting system. It is named after the Norwegian mathematician Axel Thue, who introduced systematic… … Wikipedia
Primate basal ganglia system — The primate basal ganglia system is a symmetrical major cerebral system that has only recently been recognized. In the past, part of it was presented as motor or extrapyramidal , complementary to the corticospinal (pyramidal) system. Contrary to… … Wikipedia
Tag system — A tag system is a deterministic computational model published by Emil Leon Post in 1943 as a simple form of Post canonical system. A tag system may also be viewed as an abstract machine, called a Post tag machine (not to be confused with Post… … Wikipedia
Abstract rewriting system — In mathematical logic and theoretical computer science, an abstract rewriting system (also (abstract) reduction system or abstract rewrite system; abbreviation ARS) is a formalism that captures the quintessential notion and properties of… … Wikipedia
formal logic — the branch of logic concerned exclusively with the principles of deductive reasoning and with the form rather than the content of propositions. [1855 60] * * * Introduction the abstract study of propositions, statements, or assertively used … Universalium
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Decidability (logic) — In logic, the term decidable refers to the decision problem, the question of the existence of an effective method for determining membership in a set of formulas. Logical systems such as propositional logic are decidable if membership in their… … Wikipedia
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
